Providing delay guarantees in Bluetooth

Bluetooth polling, also referred to as Bluetooth MAC scheduling or intra-piconet scheduling, is the mechanism that schedules the traffic between the participants in a Bluetooth network. Hence, this mechanism is highly determining with respect to the delay packets experience in a Bluetooth network. In this paper we present a polling mechanism that provides delay guarantees in an efficient manner and we evaluate this polling mechanism by means of simulation. It is shown that this polling mechanism is able to provide delay guarantees while saving as much as possible resources, which can be used for transmission of best effort traffic or for retransmissions

Polling in Bluetooth: a simplified best effort case

Bluetooth [1] is a wireless access mechanism where polling is used to share bandwidth among the participants. We introduce a new poller named Predictive Fair Poller [2] (PFP). We compare this poller with the conventional Round Robin poller and the Fair Exhaustive Poller [4] and show through simulations that the Predictive Fair Poller is able to divide bandwidth in a fair and efficient manner